Reference points based transformation and approximation

نویسنده

  • Csaba Török
چکیده

Interpolating and approximating polynomials have been living separately more than two centuries. Our aim is to propose a general parametric regression model that incorporates both interpolation and approximation. The paper introduces first a new r-point transformation that yields a function with a simpler geometrical structure than the original function. It uses r ≥ 2 reference points and decreases the polynomial degree by r−1. Then a general representation of polynomials is proposed based on r ≥ 1 reference points. The two-part model, which is suited to piecewise approximation, consist of an ordinary least squares polynomial regression and a reparameterized one. The later is the central component where the key role is played by the reference points. It is constructed based on the proposed representation of polynomials that is derived using the r-point transformation Tr(x). The resulting polynomial passes through r reference points and the other points approximates. Appropriately chosen reference points ensure quasi smooth transition between the two components and decrease the dimension of the LS normal matrix. We show that the model provides estimates with such statistical properties as consistency and asymptotic normality.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

رفع اعوجاج هندسی متون به‌کمک اطلاعات هندسی خطوط متن

Document images produced by scanners or digital cameras usually have photometric and geometric distortions. If either of these effects distorts document, recognition of words from such a document image using OCR is subject to errors. In this paper we propose a novel approach to significantly remove geometric distortion from document images. In this method first we extract document lines from do...

متن کامل

An Analytical Solution for Inverse Determination of Residual Stress Field

An analytical solution is presented that reconstructs residual stress field from limited and incomplete data.  The inverse problem of reconstructing residual stresses is solved using an appropriate form of the airy stress function.  This function is chosen to satisfy the stress equilibrium equations together with the boundary conditions for a domain within a convex polygon.  The analytical solu...

متن کامل

Accuracy improvement of Best Scanline Search Algorithms for Object to Image Transformation of Linear Pushbroom Imagery

Unlike the frame type images, back-projection of ground points onto the 2D image space is not a straightforward process for the linear pushbroom imagery. In this type of images, best scanline search problem complicates image processing using Collinearity equation from computational point of view in order to achieve reliable exterior orientation parameters. In recent years, new best scanline sea...

متن کامل

SUPER- AND SUB-ADDITIVE ENVELOPES OF AGGREGATION FUNCTIONS: INTERPLAY BETWEEN LOCAL AND GLOBAL PROPERTIES, AND APPROXIMATION

Super- and sub-additive transformations of aggregation functions have been recently introduced by Greco, Mesiar, Rindone and v{S}ipeky [The superadditive and the subadditive transformations of integrals and aggregation functions, {it Fuzzy Sets and Systems} {bf 291} (2016), 40--53]. In this article we give a survey of the recent development regarding the existence of aggregation functions with ...

متن کامل

Robust surface registration using N-points approximate congruent sets

Scans acquired by 3D sensors are typically represented in a local coordinate system. When multiple scans, taken from different locations, represent the same scene these must be registered to a common reference frame. We propose a fast and robust registration approach to automatically align two scans by finding two sets of N -points, that are approximately congruent under rigid transformation an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Kybernetika

دوره 49  شماره 

صفحات  -

تاریخ انتشار 2013